Fast Dating Using Least-Squares Criteria and Algorithms
نویسندگان
چکیده
منابع مشابه
Fast Dating Using Least-Squares Criteria and Algorithms
Phylogenies provide a useful way to understand the evolutionary history of genetic samples, and data sets with more than a thousand taxa are becoming increasingly common, notably with viruses (e.g., human immunodeficiency virus (HIV)). Dating ancestral events is one of the first, essential goals with such data. However, current sophisticated probabilistic approaches struggle to handle data sets...
متن کاملLeast Squares Analysis of Noise-Free Tides Using Energy Conservation and Relative Concentration of Periods Criteria
In this article, a new approach to tidal harmonic analysis is introduced. This approach incorporates more constituents in the least squares method for a fixed duration of noise-free tidal record and results in a more accurate tidal prediction. Moreover, it is demonstrated that 135 days of hourly data, which is significantly less than 369 days data in the Rayleigh criterion, is sufficient for th...
متن کاملFast Algorithms for Structured Least Squares and Total Least Squares Problems
We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z 1 and Z 2. We develop formulas for the generators of the matrix M (H) M in terms of the generators of M and show that the Cholesky factorization of the matrix M (H) M can be computed quickly if Z 1 is close to unitary and Z 2 is triangular and nilpotent. These...
متن کاملLinear Programming Algorithms Using Least-Squares Method
To my beloved wife, Yuijn iii ACKNOWLEDGEMENTS First, I want to thank my wife Yujin for her enduring patience and loving support during my study. She has been always there for me from the very beginning to this very end. She has been at the core of my motivation even when I was doubting if could finish this program. I also have to mention my beloved children, Lynn and Olivia, who have been an e...
متن کاملNew Fast Algorithms for Structured Linear Least Squares Problems
We present new fast algorithms for solving the Toeplitz and the Toeplitz-plus-Hankel least squares problems. These algorithms are based on a new fast algorithm for solving the Cauchy-like least squares problem. We perform an error analysis and provide conditions under which these algorithms are numerically stable. We also develop implementation techniques that signiicantly reduce the execution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systematic Biology
سال: 2015
ISSN: 1063-5157,1076-836X
DOI: 10.1093/sysbio/syv068